Avoiding Barren Plateaus Using Classical Shadows
نویسندگان
چکیده
Variational quantum algorithms are augmented by an additional subroutine that efficiently detects signatures of barren plateaus -- unfavorable parameter regions prevent optimization due to vanishing gradients.
منابع مشابه
Soft Planar Shadows Using Plateaus
This paper presents an algorithm for rapidly creating and rendering soft shadows on a plane. It has the advantages of rapid generation on current hardware, as well as high quality and a realistic feel on a perceptual level. The algorithm renders the soft shadow to a texture. It begins with a hard drop shadow, then uses the object’s silhouette edges to generate penumbrae in a single pass. Though...
متن کاملBarren plateaus in quantum neural network training landscapes
Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum simulation, optimization, and machine learning. Due to its simplicity and hardware efficiency, random circuits are often proposed as initial guesses for explo...
متن کاملAn Algorithm for Avoiding Plateaus in Heuristic Search
In action planning, greedy best-first search (GBFS) is one of the standard techniques if suboptimal plans are accepted. GBFS uses a heuristic function to guide the search towards a goal state. To achieve generality, in domain-independant planning the heuristic function is generated automatically. A well-known problem of GBFS are search plateaus, i. e., regions in the search space where all stat...
متن کاملA Classical Algorithm for Avoiding Local Minima
Conventional methods of supervised learning are inevitably faced with the problem of local minima; evidence is presented that conjugate gradient and quasi-Newton techniques are particularly susceptible to being trapped in sub-optimal solutions. A new classical technique is presented which by the use of a homotopy on the range of the target outputs allows supervised learning methods to find a gl...
متن کاملA Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
Greedy best-first search (GBFS) is a popular and effective algorithm in satisficing planning and is incorporated into high-performance planners. GBFS in planning decides its search direction with automatically generated heuristic functions. However, if the heuristic functions evaluate nodes inaccurately, GBFS may be misled into a valueless search direction, thus resulting in performance degrada...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PRX quantum
سال: 2022
ISSN: ['2691-3399']
DOI: https://doi.org/10.1103/prxquantum.3.020365